...-Calculus For Enhanced Strict Inheritance
نویسندگان
چکیده
We present a specialization inheritance mechanism for a strongly typed object-oriented language, called Enhanced Strict Inheritance (ESI). It is a mechanism of classi cation in which the subclassing relation between classes re ects the subtyping relationship between the corresponding types. The de nition of ESI is based on a covariant rede nition rule for methods. ESI is modeled via the &ESI-calculus, a modi cation of the &-calculus of overloaded functions due to Castagna, Ghelli and Longo [CGL93]. In ESI hierarchies the only constraint to attribute rede nition is covariance; any other restriction in rede nition rule and compatibility of result types in confusable methods is relaxed. The ESI approach to method lookup is based on a peculiar notion of point of view for multiple inheritance, called abstraction level: it drives the method lookup and possibly allow to avoid con ict problems.
منابع مشابه
Some types with inclusion properties in forall, ->, mu
This paper concerns the ∀,→, μ type system used in the non-strict functional programming language Ponder. While the type system is akin to the types of Second Order Lambda-calculus, the absence of type application makes it possible to construct types with useful inclusion relationships between them. To illustrate this, the paper contains definitions of a natural numbers type with many definable...
متن کاملInheritance as Implicit Coercion
We present a method for providing semantic interpretations for languages with a type system featuring inheritance polymorphism. Our approach is illustrated on an extension of the language Fun of Cardelli and Wegner, which we interpret via a translation into an extended polymorphic lambda calculus. Our goal is to interpret inheritances in Fun via coercion functions which are definable in the tar...
متن کاملOn the Strict Tolerant Conception of Truth
We discuss four distinct semantic consequence relations which are based on Strong Kleene theories of truth and which generalize the notion of classical consequence to 3-valued logics. Then we set up a uniform signed tableau calculus (the strict-tolerant calculus) which we show to be sound and complete with respect to each of the four semantic consequence relations. The signs employed by our cal...
متن کاملEncapsulation and behavioral inheritance in a synchronous model of computation for embedded system services adaptation
Because it encourages the incremental development of software and the reuse of code by abstracting away implementation details, object orientation is an intuitive and sensible way to conceive large software out of existing application components and libraries. In practice, however, object-orientation is most of the time applied and used with sequentiality in mind. This practice may sometimes be...
متن کاملA simple propositional calculus for compact Hausdor spaces
We introduce a simple propositional calculus for compact Hausdor spaces. Our approach is based on de Vries duality. The main new connective of our calculus is that of strict implication. We de ne the strict implication calculus SIC as our base calculus. We show that the corresponding variety SIA of strict implication algebras is a discriminator and locally nite variety. We prove that SIC is str...
متن کامل